Capturing Proof Process Andrius Velykis A thesis submitted for the degree of Doctor of Philosophy

Source URL: andrius.velykis.lt

• Automated theorem proving
• Theoretical computer science
• Logic
• Formal methods
• Mathematics
• Logic in computer science
• Proof theory
• Mathematical proof
• Proof assistant
• Isabelle
• Theorem
• Proof

DIMACS Series in Discrete Mathematics and Theoretical Computer Science A Classification of Consensus Methods for Phylogenetics David Bryant Abstract. A consensus tree method takes a collection of phylogenetic trees

Source URL: www.maths.otago.ac.nz

Meta-Logical Frameworks and Formal Digital Libraries ? Carsten Sch¨ urmann Department of Computer Science

Source URL: www.itu.dk

• Theoretical computer science
• Mathematical logic
• Logic in computer science
• Type theory
• Proof assistants
• Mathematics
• Automated theorem proving
• Isabelle
• Logical framework
• Twelf
• Formal methods
• Automated reasoning

Lazy Memo-functions John Hughes Programming Methodology Group Department of Computer Science Chalmers University of Technology SG~teborg, Sweden

Source URL: www.cse.chalmers.se

• Software engineering
• Computer programming
• Declarative programming
• Lambda calculus
• Functional programming
• Functional languages
• Subroutines
• Theoretical computer science
• Eval
• Lazy evaluation
• Lisp
• Anonymous function

Rely-Guarantee References for Refinement Types Over Aliased Mutable Data (Extended Version ∗) Colin S. Gordon, Michael D. Ernst, and Dan Grossman University of Washington {csgordon,mernst,djg}@cs.washington.edu

Source URL: homes.cs.washington.edu

• Mathematical logic
• Logic
• Theoretical computer science
• Logic in computer science
• Semantics
• Heap
• Predicate
• Immutable object
• Separation logic
• First-order logic
• Control
• FO

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:2, 2014, 207–224 The Price of Connectivity for Vertex Cover Eglantine Camby1 Jean Cardinal1 Samuel Fiorini2 Oliver Schaudt3∗

Source URL: homepages.ulb.ac.be

Extracting Frame Conditions from Operation Contracts

Source URL: www.db.informatik.uni-bremen.de

• Theoretical computer science
• Formal methods
• Software engineering
• Logic in computer science
• Postcondition
• Object Constraint Language
• Causality
• Statistics
• Statistical hypothesis testing
• Invariant

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

Abstract Path Planning for Multiple Robots: An Empirical Study Pavel Surynek Charles University in Prague Faculty of Mathematics and Physics Department of Theoretical Computer Science and Mathematical Logic Malostranské

Source URL: iti.mff.cuni.cz